The function that is minimized can be entered via a truth table that represents the function y = f(xn,...,x1, x0). You can manually edit this function by clicking on the gray elements in the y column. Alternatively, you can generate a random function by pressing the "Random example" button.
Number of input variables:
Allow Don’t-Care:
| x2 | x1 | x0 | y | |
|---|---|---|---|---|
| 0: | 0 | 0 | 0 | 0 |
| 1: | 0 | 0 | 1 | 0 |
| 2: | 0 | 1 | 0 | 0 |
| 3: | 0 | 1 | 1 | 0 |
| 4: | 1 | 0 | 0 | 0 |
| 5: | 1 | 0 | 1 | 0 |
| 6: | 1 | 1 | 0 | 0 |
| 7: | 1 | 1 | 1 | 0 |
Minimal boolean expression:
y = 0
Legend:
Don't-care: ×
Implicant (non prime): →
Prime implicant: ✓
Essential prime implicant: ●
Prime implicant but covers only don't-care: (×)
The JavaScript source code can be found here: qmc.js.
This website is part of the lecture Technical Computer Science I.
Keywords: interactive Quine–McCluskey algorithm, method of prime implicants, Quine–McCluskey method, Petrick's method for cyclic covering problems, prime implicant chart, html5, javascript